Linguistic Weighted Aggregation under Confidence Levels
نویسندگان
چکیده
منابع مشابه
Aggregation Operators for Linguistic Weighted Information Aggregation Operators for Linguistic Weighted Information
The aim of this paper is to model the processes of the aggregation of weighted information in a linguistic framework. Three aggregation operators of weighted linguistic information are presented: linguistic weighted disjunction (LWD) operator, linguistic weighted conjunction (LWC) operator and linguistic weighted averaging (LWA) operator. A study of their axiomatic is presented to demonstrate t...
متن کاملAggregation operators for linguistic weighted information
The aim of this paper is to model the processes of the aggregation of weighted information in a linguistic framework. Three aggregation operators of weighted linguistic information are presented: linguistic weighted disjunction (LWD) operator, linguistic weighted conjunction (LWC) operator, and linguistic weighted averaging (LWA) operator. A study of their axiomatics is presented to demonstrate...
متن کاملConfidence-Weighted Bipartite Ranking
Bipartite ranking is a fundamental machine learning and data mining problem. It commonly concerns the maximization of the AUC metric. Recently, a number of studies have proposed online bipartite ranking algorithms to learn from massive streams of class-imbalanced data. These methods suggest both linear and kernel-based bipartite ranking algorithms based on first and second-order online learning...
متن کاملExact Convex Confidence-Weighted Learning
Confidence-weighted (CW) learning [6], an online learning method for linear clas-sifiers, maintains a Gaussian distributions over weight vectors, with a covariancematrix that represents uncertainty about weights and correlations. Confidenceconstraints ensure that a weight vector drawn from the hypothesis distributioncorrectly classifies examples with a specified probability. Wit...
متن کاملMulti-Class Confidence Weighted Algorithms
The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW learning updates and inference cannot be computed analytically or solved as convex optimization problems as they are in the binary case. We derive learning algorithms for the multi-class CW setting and provide extensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/485923